WATERMARKING FOR 3D POLYGONS USING WAVELET TRANSFORM AND MODIFIED TRAVELING SALESMAN PROBLEM
نویسندگان
چکیده
منابع مشابه
Watermarking for 3d Polygons Using Wavelet Transform and Modified Traveling Salesman Problem
Recent developments in computer technologies and networks have enabled the use of high-quality digital contents, such as electronic documents, images, and audio and video contents. A watermarking technique has recently been developed for the copyright protection of these digital contents. There are few watermarking techniques for three-dimensional (3D) geometric models, such as solid models or ...
متن کاملDigital Watermarking for 3D Polygons using Multiresolution Wavelet Decomposition
Recently, much interest is being taken in methods to protect the copyright of digital data and preventing illegal duplication of it. However, in the area of CAD/CAM and CG, there are no effective ways to protect the copyright of 3D geometric models. As a first step to solve this problem, a new digital watermarking method for 3D polygonal models is introduced in this paper. Watermarking is one o...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کامل2D and 3D Traveling Salesman Problem
When a two-dimensional (2D) traveling salesman problem (TSP) is presented on a computer screen, human subjects can produce near-optimal tours in linear time. In this study we tested human performance on a real and virtual floor, as well as in a threedimensional (3D) virtual space. Human performance on the real floor is as good as that on a computer screen. Performance on a virtual floor is very...
متن کاملUsing the Traveling Salesman Problem
Theoretical computer science has given birth to a very intriguing and fascinating class of problems known as Nondeterministic Polynomial-time (NP) complete problems. Among their captivating properties are their computational complexity despite often deceptively simple formulations. An example of this is the ubiquitous Traveling Salesman Problem (TSP). This problem has had an uncontested popular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2009
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.52.402